An Incremental and Non-generational Coevolutionary Algorithm
نویسندگان
چکیده
The central idea of coevolution lies in the fact that the fitness of an individual depends on its performance against the current individuals of the opponent population. However, coevolution has been shown to have problems [2,5]. Methods and techniques have been proposed to compensate the flaws in the general concept of coevolution [2]. In this article we propose a different approach to implementing coevolution, called incremental coevolutionary algorithm (ICA) in which some of these problems are solved by design. In ICA, the importance of the coexistance of individuals in the same population is as important as the individuals in the opponent population. This is similar to the problem faced by learning classifier systems (LCSs) [1,4]. We take ideas from these algorithms and put them into ICA. In a coevolutionary algorithm, the fitness landscape depends on the opponent population, therefore it changes every generation. The individuals selected for reproduction are those more promising to perform better against the fitness landscape represented by the opponent population. However, if the complete population of parasites and hosts are recreated in every generation, the offspring of each new generation face a fitness landscape unlike the one they where bred to defeat. Clearly, a generational approach to coevolution can be too disruptive. Since the fitness landscape changes every generation, it also makes sense to incrementally adjust the fitness of individuals in each one. These two ideas define the main approach of the ICA: the use of a non-generational genetic algorithm and the incremental adjustment of the fitness estimation of an individual. The formal definition of ICA can be seen in figure 1. ICA has some interesting properties. First of all, it is not generational. Each new individual faces a similar fitness landscape than its parents. The fitness landscape changes gradually, allowing an arms race to occur. Since opponents are chosen proportional to their fitness, an individual has a greater chance of facing good opponents. If a particular strength is found in a population, individuals that have it will propagate and will have a greater probability of coming into competition (both because more individuals carry the strength, and because a
منابع مشابه
Similarities Between Co-evolution and Learning Classifier Systems and Their Applications
This article describes the similarities between learning classifier systems (LCSs) and coevolutionary algorithm, and exploits these similarities by taking ideas used by LCSs to design a non-generational coevolutionary algorithm that incrementally estimates fitness of individuals. The algorithm solves some of the problems known to exist in coevolutionary algorithms: it does not loose gradient an...
متن کاملTracking performance of incremental LMS algorithm over adaptive distributed sensor networks
in this paper we focus on the tracking performance of incremental adaptive LMS algorithm in an adaptive network. For this reason we consider the unknown weight vector to be a time varying sequence. First we analyze the performance of network in tracking a time varying weight vector and then we explain the estimation of Rayleigh fading channel through a random walk model. Closed form relations a...
متن کاملAn Incremental DC Algorithm for the Minimum Sum-of-Squares Clustering
Here, an algorithm is presented for solving the minimum sum-of-squares clustering problems using their difference of convex representations. The proposed algorithm is based on an incremental approach and applies the well known DC algorithm at each iteration. The proposed algorithm is tested and compared with other clustering algorithms using large real world data sets.
متن کاملEMCSO: An Elitist Multi-Objective Cat Swarm Optimization
This paper introduces a novel multi-objective evolutionary algorithm based on cat swarm optimizationalgorithm (EMCSO) and its application to solve a multi-objective knapsack problem. The multi-objective optimizers try to find the closest solutions to true Pareto front (POF) where it will be achieved by finding the less-crowded non-dominated solutions. The proposed method applies cat swarm optim...
متن کاملDistributed and Cooperative Compressive Sensing Recovery Algorithm for Wireless Sensor Networks with Bi-directional Incremental Topology
Recently, the problem of compressive sensing (CS) has attracted lots of attention in the area of signal processing. So, much of the research in this field is being carried out in this issue. One of the applications where CS could be used is wireless sensor networks (WSNs). The structure of WSNs consists of many low power wireless sensors. This requires that any improved algorithm for this appli...
متن کامل